Homotopy techniques for tensor decomposition and perfect identifiability
نویسندگان
چکیده
منابع مشابه
Homotopy Techniques for Tensor Decomposition and Perfect Identifiability
Let T be a general complex tensor of format (n1, ..., nd). When the fraction ∏ i ni/[1+ ∑ i(ni−1)] is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that T has finitely many minimal decomposition as a sum of decomposable tensors. We show how homotopy techniques allow us to find all the decompositions of T , starting from a given one. In particular this g...
متن کاملHomotopy Analysis for Tensor PCA
Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this paper, we analyze the class of homotopy or continuation methods for global optimization of nonconvex functions. These methods start from an objective function...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملIdentifiability of Kronecker-structured Dictionaries for Tensor Data
This paper derives sufficient conditions for reliable recovery of coordinate dictionaries comprising a Kroneckerstructured dictionary that is used for representing Kth-order tensor data. Tensor observations are generated by a Kroneckerstructured dictionary and sparse coefficient tensors that follow the separable sparsity model. This work provides sufficient conditions on the underlying coordina...
متن کاملEntanglement and tensor product decomposition for two
The problem of the choice of tensor product decomposition in a system of two fermions with the help of Bogoliubov transformations of creation and annihilation operators is discussed. The set of physical states of the composite system is restricted by the superselection rule forbidding the superposition of fermions and bosons. It is shown that the Wootters concurrence is not the proper entanglem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal für die reine und angewandte Mathematik (Crelles Journal)
سال: 2019
ISSN: 1435-5345,0075-4102
DOI: 10.1515/crelle-2016-0067